Listar por autor "Fariña, Antonio"

Mostrando ítems 1-9 de 9

    • An Efficient Representation of Enriched Temporal Trajectories 

      Brisaboa, Nieves R.; Fariña, Antonio; Otero-González, Diego; Varela Rodeiro, Tirso (SciTePress, 2021)
      [Abstract] We present a novel representation of enriched trajectories of a mobile workforce management system. In this system, employees are tracked during their working day and both their routes and the tasks performed ...

    • Compact Trip Representation over Networks 

      Brisaboa, Nieves R.; Fariña, Antonio; Galaktionov, Daniil; Rodríguez, M. Andrea (Springer, 2016-09-21)
      [Abstract] We present a new Compact Trip Representation ( CTRCTR ) that allows us to manage users’ trips (moving objects) over networks. These could be public transportation networks (buses, subway, trains, and so on) where ...

    • Compressed and queryable self-indexes for RDF archives 

      Cerdeira-Pena, Ana; Bernardo, Guillermo de; Fariña, Antonio; Fernández, Javier D.; Martínez-Prieto, Miguel A. (Springer Nature, 2023-08)
      [Abstract]: RDF compression and querying are consolidated topics in the Web of Data, with a plethora of solutions to efficiently store and query static datasets. However, as RDF data changes along time, it becomes necessary ...

    • Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes 

      Fariña, Antonio; Gagie, Travis; Manzini, Giovanni; Navarro, Gonzalo; Ordóñez, Alberto (Springer, 2016-09-21)
      [Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when ...

    • New Compression Codes for Text Databases 

      Fariña, Antonio (2005)
      [Abstract] Text databases are growing in the last years due to the widespread use of digital libraries, document databases and mainly because of the continuous growing of the Web. Compression comes up as an ideal solution ...

    • Revisiting Compact RDF Stores Based on k2-Trees 

      Brisaboa, Nieves R.; Cerdeira-Pena, Ana; Bernardo, Guillermo de; Fariña, Antonio (IEEE Xplore, 2020-03)
      [Abstract]: We present a new compact representation to efficiently store and query large RDF datasets in main memory. Our proposal, called BMatrix, is based on the k 2 -tree, a data structure devised to represent binary ...

    • Space/time-efficient RDF stores based on circular suffix sorting 

      Brisaboa, Nieves R.; Cerdeira-Pena, Ana; Bernardo, Guillermo de; Fariña, Antonio; Navarro, Gonzalo (Springer Nature, 2023-03)
      [Abstract]: The resource description framework (RDF) has gained popularity as a format for the standardized publication and exchange of information in the Web of Data. In this paper, we introduce RDFCSA, a compressed ...

    • Towards a Compact Representation of Temporal Rasters 

      Cerdeira-Pena, Ana; Bernardo, Guillermo de; Fariña, Antonio; Paramá, José R.; Silva-Coira, Fernando (Springer Nature, 2018-09)
      [Abstract]: Big research efforts have been devoted to efficiently manage spatio-temporal data. However, most works focused on vectorial data, and much less, on raster data. This work presents a new representation for raster ...

    • Universal indexes for highly repetitive document collections 

      Claude, Francisco; Fariña, Antonio; Martínez Prieto, Miguel A.; Navarro, Gonzalo (Elsevier Ltd, 2016-11)
      [Abstract] Indexing highly repetitive collections has become a relevant problem with the emergence of large repositories of versioned documents, among other applications. These collections may reach huge sizes, but are ...